321 research outputs found
Inversion of Toeplitz operators, Levinson equations, and Gohberg-Krein factorization—A simple and unified approach for the rational case
AbstractThe problem of the inversion of the Toeplitz operator TΦ, associated with the operator-valued function Φ defined on the unit circle, is known to involve the associated Levinson system of equations and the Gohberg-Krein factorization of Φ. A simplified and self-contained approach, making clear the connections between these three problems, is presented in the case where Φ is matrix-valued and rational. The key idea consists in looking at the Levinson system of equations associated with Φ−1(z−1), rather than that associated with Φ(z). As a consequence, a new invertibility criterion for Toeplitz operators with rational matrix-valued symbols is derived
Unitary designs and codes
A unitary design is a collection of unitary matrices that approximate the
entire unitary group, much like a spherical design approximates the entire unit
sphere. In this paper, we use irreducible representations of the unitary group
to find a general lower bound on the size of a unitary t-design in U(d), for
any d and t. We also introduce the notion of a unitary code - a subset of U(d)
in which the trace inner product of any pair of matrices is restricted to only
a small number of distinct values - and give an upper bound for the size of a
code of degree s in U(d) for any d and s. These bounds can be strengthened when
the particular inner product values that occur in the code or design are known.
Finally, we describe some constructions of designs: we give an upper bound on
the size of the smallest weighted unitary t-design in U(d), and we catalogue
some t-designs that arise from finite groups.Comment: 25 pages, no figure
Selective and Efficient Quantum Process Tomography
In this paper we describe in detail and generalize a method for quantum
process tomography that was presented in [A. Bendersky, F. Pastawski, J. P.
Paz, Physical Review Letters 100, 190403 (2008)]. The method enables the
efficient estimation of any element of the --matrix of a quantum process.
Such elements are estimated as averages over experimental outcomes with a
precision that is fixed by the number of repetitions of the experiment.
Resources required to implement it scale polynomically with the number of
qubits of the system. The estimation of all diagonal elements of the
--matrix can be efficiently done without any ancillary qubits. In turn,
the estimation of all the off-diagonal elements requires an extra clean qubit.
The key ideas of the method, that is based on efficient estimation by random
sampling over a set of states forming a 2--design, are described in detail.
Efficient methods for preparing and detecting such states are explicitly shown.Comment: 9 pages, 5 figure
On the high density behavior of Hamming codes with fixed minimum distance
We discuss the high density behavior of a system of hard spheres of diameter
d on the hypercubic lattice of dimension n, in the limit n -> oo, d -> oo,
d/n=delta. The problem is relevant for coding theory. We find a solution to the
equations describing the liquid up to very large values of the density, but we
show that this solution gives a negative entropy for the liquid phase when the
density is large enough. We then conjecture that a phase transition towards a
different phase might take place, and we discuss possible scenarios for this
transition. Finally we discuss the relation between our results and known
rigorous bounds on the maximal density of the system.Comment: 15 pages, 6 figure
A new Euclidean tight 6-design
We give a new example of Euclidean tight 6-design in .Comment: 9 page
Unbiased bases (Hadamards) for 6-level systems: Four ways from Fourier
In quantum mechanics some properties are maximally incompatible, such as the
position and momentum of a particle or the vertical and horizontal projections
of a 2-level spin. Given any definite state of one property the other property
is completely random, or unbiased. For N-level systems, the 6-level ones are
the smallest for which a tomographically efficient set of N+1 mutually unbiased
bases (MUBs) has not been found. To facilitate the search, we numerically
extend the classification of unbiased bases, or Hadamards, by incrementally
adjusting relative phases in a standard basis. We consider the non-unitarity
caused by small adjustments with a second order Taylor expansion, and choose
incremental steps within the 4-dimensional nullspace of the curvature. In this
way we prescribe a numerical integration of a 4-parameter set of Hadamards of
order 6.Comment: 5 pages, 2 figure
A simple construction of complex equiangular lines
A set of vectors of equal norm in represents equiangular lines
if the magnitudes of the inner product of every pair of distinct vectors in the
set are equal. The maximum size of such a set is , and it is conjectured
that sets of this maximum size exist in for every . We
describe a new construction for maximum-sized sets of equiangular lines,
exposing a previously unrecognized connection with Hadamard matrices. The
construction produces a maximum-sized set of equiangular lines in dimensions 2,
3 and 8.Comment: 11 pages; minor revisions and comments added in section 1 describing
a link to previously known results; correction to Theorem 1 and updates to
reference
Weighing matrices and spherical codes
Mutually unbiased weighing matrices (MUWM) are closely related to an
antipodal spherical code with 4 angles. In the present paper, we clarify the
relationship between MUWM and the spherical sets, and give the complete
solution about the maximum size of a set of MUWM of weight 4 for any order.
Moreover we describe some natural generalization of a set of MUWM from the
viewpoint of spherical codes, and determine several maximum sizes of the
generalized sets. They include an affirmative answer of the problem of Best,
Kharaghani, and Ramp.Comment: Title is changed from "Association schemes related to weighing
matrices
Symmetric Informationally Complete Quantum Measurements
We consider the existence in arbitrary finite dimensions d of a POVM
comprised of d^2 rank-one operators all of whose operator inner products are
equal. Such a set is called a ``symmetric, informationally complete'' POVM
(SIC-POVM) and is equivalent to a set of d^2 equiangular lines in C^d.
SIC-POVMs are relevant for quantum state tomography, quantum cryptography, and
foundational issues in quantum mechanics. We construct SIC-POVMs in dimensions
two, three, and four. We further conjecture that a particular kind of
group-covariant SIC-POVM exists in arbitrary dimensions, providing numerical
results up to dimension 45 to bolster this claim.Comment: 8 page
MUBs inequivalence and affine planes
There are fairly large families of unitarily inequivalent complete sets of
N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The
number of such sets is not bounded above by any polynomial as a function of N.
While it is standard that there is a superficial similarity between complete
sets of MUBs and finite affine planes, there is an intimate relationship
between these large families and affine planes. This note briefly summarizes
"old" results that do not appear to be well-known concerning known families of
complete sets of MUBs and their associated planes.Comment: This is the version of this paper appearing in J. Mathematical
Physics 53, 032204 (2012) except for format changes due to the journal's
style policie
- …